Simulating non-Markovian stochastic processes.
نویسندگان
چکیده
We present a simple and general framework to simulate statistically correct realizations of a system of non-Markovian discrete stochastic processes. We give the exact analytical solution and a practical and efficient algorithm like the Gillespie algorithm for Markovian processes, with the difference being that now the occurrence rates of the events depend on the time elapsed since the event last took place. We use our non-Markovian generalized Gillespie stochastic simulation methodology to investigate the effects of nonexponential interevent time distributions in the susceptible-infected-susceptible model of epidemic spreading. Strikingly, our results unveil the drastic effects that very subtle differences in the modeling of non-Markovian processes have on the global behavior of complex systems, with important implications for their understanding and prediction. We also assess our generalized Gillespie algorithm on a system of biochemical reactions with time delays. As compared to other existing methods, we find that the generalized Gillespie algorithm is the most general because it can be implemented very easily in cases (such as for delays coupled to the evolution of the system) in which other algorithms do not work or need adapted versions that are less efficient in computational terms.
منابع مشابه
Discrete random walk models for symmetric Lévy - Feller diffusion processes
We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index α (0 < α ≤ 2), in the symmetric case. We show that by properly scaled transition to vanishing space and time steps our random walk models converge to the corresponding continuous Markovian stochastic processes, that we refer to as Lévy-Feller diffusion pr...
متن کاملTemporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks
Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical...
متن کاملAlmost sure exponential stability of stochastic reaction diffusion systems with Markovian jump
The stochastic reaction diffusion systems may suffer sudden shocks, in order to explain this phenomena, we use Markovian jumps to model stochastic reaction diffusion systems. In this paper, we are interested in almost sure exponential stability of stochastic reaction diffusion systems with Markovian jumps. Under some reasonable conditions, we show that the trivial solution of stocha...
متن کاملPhase-Type Approximations for Non-Markovian Systems
We introduce a novel stochastic process algebra, called PHASE, which directly supports phase-type distributions, useful for approximating the dynamics of non-Markovian HCI systems. In order to encourage the effective use of PHASE, we give a step by step account of how PHASE processes can be implemented in PRISM, one of the most powerful and popular probabilistic model checkers currently availab...
متن کاملMarkov chains for random dynamical systems on p-adic trees
We study Markovian and non-Markovian behaviour of stochastic processes generated by random dynamical systems on p-adic trees. In fact, such systems can be interpreted as stochastic neural networks operating on branches of the homogeneous p-adic tree (where p > 1 is a prime number). Key-Words: Random dynamical systems, p-adic numbers, Markovian property
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 90 4 شماره
صفحات -
تاریخ انتشار 2014